The Langlands-Shahidi method for pairs via types and covers

نویسندگان

چکیده

We compute the local coefficient attached to a pair ( π 1 , 2 stretchy="false">) (\pi _1,\pi _2) of supercuspidal (complex) representations general linear group using theory types and covers à la Bushnell-Kutzko. In process, we obtain another proof well-known formula Shahidi for corresponding Plancherel constant. The approach taken here can be adapted other situations arithmetic interest within context Langlands-Shahidi method, particularly that Siegel Levi subgroup inside classical group.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing local coefficients via types and covers‎: ‎the example of $SL(2)$

‎We illustrate a method of computing Langlands-Shahidi local coefficients via the theory of types and covers‎. ‎The purpose of this paper is to illustrate a method of computing the Langlands-Shahidi local coefficients using the theory of types and covers.

متن کامل

A Summary of the Langlands-Shahidi Method of Constructing L-functions

These notes are from the Database of Automorphic L-functions at http://www.math.rutgers.edu/∼sdmiller/l-functions . They were written up by Stephen Miller, and are based on discussions with Freydoon Shahidi, Purdue University. They are meant to serve as an introduction to the Langlands-Shahidi method of studying L-functions through the Fourier coefficients of Eisenstein series.

متن کامل

the search for the self in becketts theatre: waiting for godot and endgame

this thesis is based upon the works of samuel beckett. one of the greatest writers of contemporary literature. here, i have tried to focus on one of the main themes in becketts works: the search for the real "me" or the real self, which is not only a problem to be solved for beckett man but also for each of us. i have tried to show becketts techniques in approaching this unattainable goal, base...

15 صفحه اول

Finding Large Set Covers Faster via the Representation Method

The worst-case fastest known algorithm for the Set Cover problem on universes with n elements still essentially is the simple O∗(2n)-time dynamic programming algorithm, and no non-trivial consequences of an O∗(1.01n)-time algorithm are known. Motivated by this chasm, we study the following natural question: Which instances of Set Cover can we solve faster than the simple dynamic programming alg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Representation Theory of The American Mathematical Society

سال: 2022

ISSN: ['1088-4165']

DOI: https://doi.org/10.1090/ert/620